Diierential Cryptanalysis of Feal and N-hash
نویسندگان
چکیده
In 1,2] we introduced the notion of diierential cryptanalysis and described its application to DESS11] and several of its variants. In this paper we show the applicability of diierential cryptanalysis to the Feal family of encryption algorithms and to the N-Hash hash function. In addition, we show how to transform diierential cryptanalytic chosen plaintext attacks into known plaintext attacks.
منابع مشابه
Differential Cryptanalysis of Feal and N-Hash
In [1,2] we introduced the notion of differential cryptanalysis and described its application to DES[8] and several of its variants. In this paper we show the applicability of differential cryptanalysis to the Feal family of encryption algorithms and to the N-Hash hash function.
متن کاملOn Matsui's Linear Cryptanalysis
to linear cryptanalysis. We also described how to sum up characteristics (which also hold in diierential cryptanalysis). The iteration of this characteristic to seven rounds have probability 1=2 ? 2 ?11. A similar characteristic exist with a reverse order of the bytes in each word. From the tables in 9] we can see that about 4 2 112 = 2 24 known plaintexts are required to attack Feal-8, with su...
متن کاملDifferential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer
In 1,2] we introduced the notion of diierential cryptanalysis based on chosen plaintext attacks. In 3,4] we described the application of diierential crypt-analysis to Feall12,11] and extended the method to known plaintext attacks. In this paper diierential cryptanalysis methods are applied to the hash function Snefruu9] and to the cryptosystems Khafree10], REDOC-III14,6], LOKII5] and Luciferr7].
متن کاملImproved Characteristics for Diierential Cryptanalysis of Hash Functions Based on Block Ciphers
In this paper we present an improvement of the diierential attack on hash functions based on block ciphers. By using the speciic properties of the collision attack on hash functions, we can greatly reduce the work factor to nd a pair that follows the characteristic. We propose a new family of diierential characteristics that is especially useful in combination with our improvement. Attacks on a...
متن کاملLinear Cryptanalysis of the Fast Data Encipherment Algorithm
This paper discusses the security of the Fast Data Encipherment Algorithm (FEAL) against Linear Cryptanalysis. It has been confirmed that the entire subkeys used in FEAL–8 can be derived with 2 pairs of known plaintext and ciphertext with a success rate over 70% spending about 1 hour using a WS (SPARCstation 10 Model 30). This paper also evaluates the security of FEAL–N in comparison with that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991